[livres divers classés par sujet] [Informatique] [Algorithmique] [Programmation] [Mathématiques] [Hardware] [Robotique] [Langage] [Intelligence artificielle] [Réseaux]
[Bases de données] [Télécommunications] [Chimie] [Médecine] [Astronomie] [Astrophysique] [Films scientifiques] [Histoire] [Géographie] [Littérature]

The Expressive Power of Simple Logical Fragments over Traces

contributor FMI, Theoretische Informatik
creator Horsch, Martin
Kufleitner, Manfred
date 2006-05-23
description 17 pages
We compare the expressive power of some first-order fragments and of two simple temporal logics over Mazurkiewicz traces. Over words, most of these fragments have the same expressive power whereas over traces we show that the ability of formulating concurrency increases the expressive power. We also show that over so-called dependence structures it is impossible to formulate concurrency with the first-order fragments under consideration. Although the first-order fragments $\Delta_n[<]$ and $FO^2[<]$ over partial orders both can express concurrency of two actions, we show that in general they are incomparable over traces. For $FO^2[<]$ we give a characterization in terms of temporal logic by allowing an operator for parallelism.
format application/pdf
178113 Bytes
identifier  http://www.informatik.uni-stuttgart.de/cgi-bin/NCSTRL/NCSTRL_view.pl?id=TR-2006-06&engl=1
language eng
publisher Stuttgart, Germany, Universität Stuttgart
relation Technical Report No. 2006/06
source ftp://ftp.informatik.uni-stuttgart.de/pub/library/ncstrl.ustuttgart_fi/TR-2006-06/TR-2006-06.pdf
subject Mathematical Logic (CR F.4.1)
First-order logic
Temporal logic
Mazurkiewicz traces
Ehrenfeucht-Fraisse games
title The Expressive Power of Simple Logical Fragments over Traces
type Text
Technical Report